Self - De nable Claw Free Functions
نویسندگان
چکیده
We propose a new type of claw free function family, a pseudo self-de nable claw free function family , which provides, by Damg ard's construction, a collision intractable hash function family that is more suitable in several cryptographic applications such as digital signature, bit commitment, etc. We give an example of self-de nable claw free function families based on the hardness of some number theoretic problem. We also show some concrete situation where our claw free notion is indeed necessary.
منابع مشابه
On Definable Skolem Functions in Weakly O-Minimal nonvaluational Structures
We prove that all known examples of weakly o-minimal non-valuational structures have no de nable Skolem functions. We show, however, that such structures eliminate imaginaries up to de nable families of cuts. Along the way we give some new examples of weakly ominimal non-valuational structures.
متن کاملOn Claw Free Families
On claw free families Abstract This paper points out that there are two types of claw free families with respect to a level of claw freeness. We formulate them as weak claw free families and strong claw free families. Then, we present suucient conditions for each type of claw free families. (A similar result is known for weak claw free families.) They are represented as some algebraic forms of ...
متن کاملInfinitely Definable Structures in Small Theories
We observe simple links between preorders, semi-groups, rings and categories (and between equivalence relations, groups, elds and groupoids), which are in nitely de nable in an arbitrary structure, and apply these observations to small structures. Recall that a structure is small if it has countably many pure n-types for each integer n. A category de ned by a pure n-type in a small structure is...
متن کاملRESOLVING STANLEY’S e-POSITIVITY OF CLAW-CONTRACTIBLE-FREE GRAPHS
In Stanley’s seminal 1995 paper on the chromatic symmetric function, he stated that there was no known graph that was not contractible to the claw and whose chromatic symmetric function was not e-positive, namely, not a positive linear combination of elementary symmetric functions. We resolve this by giving infinite families of graphs that are not contractible to the claw and whose chromatic sy...
متن کاملStrengthening the closure concept in claw-free graphs
We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G de ned here is uniquely determined and preserves the value of the circumference of G. We present an in nite family of graphs with n vertices and 3 2 n 1 edges for which the new closure is the
متن کامل